Smooth dendroids without ordinary points
نویسندگان
چکیده
منابع مشابه
Ordinary Smooth Topological Spaces
In this paper, we introduce the concept of ordinary smooth topology on a set X by considering the gradation of openness of ordinary subsets of X . And we obtain the result [Corollary 2.13] : An ordinary smooth topology is fully determined its decomposition in classical topologies. Also we introduce the notion of ordinary smooth [resp. strong and weak] continuity and study some its properties. A...
متن کاملOn Finding Ordinary Intersection Points∗
An algorithm is demonstrated that finds an ordinary intersection in an arrangement of n lines in R, not all parallel and not all passing through a common point, in time O(n logn). The algorithm is then extended to find an ordinary intersection among an arrangement of hyperplanes in R, no d passing through a line and not all passing through the same point, again, in time O(n logn). Two additiona...
متن کاملA Collection of Dendroids
An uncountable collection of uniformly arcwise connected plane Suslinian dendroids is constructed which shows that the negations of the following properties: local connectedness, smoothness, pointwise smoothness, hereditary contractibility, and selectibility are not countable in this class of
متن کاملBottlenecks in Dendroids
A subcontinuum C of a dendroid X is a bottleneck if it intersects every arc connecting two nonempty open subsets of X. We prove that every dendroid has a point p contained in arbitrarily small bottlenecks. Moreover, every plane dendroid contains a single point bottleneck. This implies, for instance, that each map from an indecomposable continuum into a plane dendroid must have an uncountable po...
متن کاملOn Finding Ordinary or Monochromatic Intersection Points
An algorithm is demonstrated that finds an ordinary intersection in an arrangement of n lines in R, not all parallel and not all passing through a common point, in time O(n log n). The algorithm is then extended to find an ordinary intersection among an arrangement of hyperplanes in R, no d passing through a line and not all passing through the same point, again, in time O(n log n). Two additio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1984
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-122-1-61-70